The Algebraic Mu-Calculus and MTBDDs
نویسندگان
چکیده
The paper presents a new calculus (called algebraic mu-calculus) which generalizes Park's relational mu-calculus by representing arithmetric expressions and real-valued functions rather than formulas and relations. Moreover, we give an algorithm for computing the MTBDD-representation of the semantics for the expressions and terms and show how several problems (such as graph theoretic problems or veriication problems) can be embedded into the algebraic mu-calculus (and hence, can be solved using our MTBDD-based method).
منابع مشابه
CASPA: Symbolic model checking of stochastic systems
This note describes the new features of the performance evaluation tool CASPA, which has been extended by algorithms for the model checking of stochastic systems. CASPA uses stochastic process algebras as its input language. Multi-terminal binary decision diagrams (MTBDD) are employed to represent the transition system underlying a given process algebraic specification. The specification of per...
متن کاملAlgorithmic correspondence for intuitionistic modal mu-calculus, Part 2
Sahlqvist-style correspondence results remain a perennial theme and an active topic of research within modal logic. Recently, there has been interest in extending the classical results in this area to the modal mu-calculus [7]. For instance, in [8] van Benthem, Bezhanishvili and Hodkinson define a class of Sahlqvist formulas for the modal mu-calculus, all of which have frame correspondents in f...
متن کاملAlgorithmic correspondence for intuitionistic modal mu-calculus
In the present paper, the algorithmic correspondence theory developed in (Conradie and Palmigiano, 2012) is extended to mu-calculi with a non-classical base. We focus in particular on the language of bi-intuitionistic modal mu-calculus. We enhance the algorithm ALBA introduced in (Conradie and Palmigiano, 2012) so as to guarantee its success on the class of recursive muinequalities, which we in...
متن کاملOrder theoretic Correspondence theory for Intuitionistic mu-calculus
Sahlqvist correspondence theory [3], [4] is one of the most important and useful results of classical modal logic. It gives a syntactic identification of a class of modal formulas whose associated normal modal logics are strongly complete with respect to elementary (i.e. first-order definable) classes of frames. Every Sahlqvist formula is both canonical and corresponds to some elementary frame ...
متن کاملSimilarity DH-Algebras
In cite{GL}, B. Gerla and I. Leuc{s}tean introduced the notion of similarity on MV-algebra. A similarity MV-algebra is an MV-algebra endowed with a binary operation $S$ that verifies certain additional properties. Also, Chirtec{s} in cite{C}, study the notion of similarity on L ukasiewicz-Moisil algebras. In particular, strong similarity L ukasiewicz-Moisil algebras were defined. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998